Character sums and deterministic polynomial root finding in finite fields
نویسندگان
چکیده
منابع مشابه
Character Sums and Deterministic Polynomial Root Finding in Finite Fields
Let Fq be a finite field of q elements of characteristic p. The classical algorithm of Berlekamp [1] reduces the problem of factoring polynomials of degree n over Fq to the problem of factoring squarefree polynomials of degree n over Fp that fully split in Fp, see also [8, Chapter 14]. Shoup [15, Theorem 3.1] has given a deterministic algorithm that fully factors any polynomial of degree n over...
متن کاملCharacter Sums in Finite Fields
Let F q be a finite field of order q with q = p n , where p is a prime. A multiplicative character χ is a homomorphism from the multiplicative group F * q , ·· to the unit circle. In this note we will mostly give a survey of work on bounds for the character sum x χ(x) over a subset of F q. In Section 5 we give a nontrivial estimate of character sums over subspaces of finite fields. §1. Burgess'...
متن کاملIrreducibility and Deterministic r-th Root Finding over Finite Fields
Constructing r -th nonresidue over a nite eld is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree r e (where r is a prime) over a given nite eld Fq of characteristic p (equivalently, constructing the bigger eld Fqr e ). Both these problems have famous randomized algorithms but the derandomization is an open question. We give some ne...
متن کاملSum-Product and Character Sums in finite fields
In this talk I will present estimates on incomplete character sums in finite fields, with special emphasize on the non-prime case. Some of the results are of the same strength as Burgess celebrated theorem for prime fields. The improvements are mainly based on arguments from arithmetic combinatorics providing new bounds on multiplicative energy and an improved amplification strategy. In particu...
متن کاملFINITE FIELDS AND APPLICATIONS Characters and character sums (9 lectures)
Exponential sums and character sums have many applications in number theory and combinatorial number theory. Many famous and interesting problems have been studied by means of exponential sums techniques: Goldbach ternary conjecture (Vinogradov), Waring Problem (Hardy, Littlewood, Vaughan, Vinogradov, Wooley), Distribution of prime numbers (Ford, Hardy, Korobov, Linnik,...) as well as many othe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2015
ISSN: 0025-5718,1088-6842
DOI: 10.1090/mcom/2946